On Finding Elements in Inertia Groups by Reduction Modulo p

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the topology of algebraic surfaces and reduction modulo p

We show that the topology of a simply-connected smooth projective surface is determined by its algebraic structure modulo p.

متن کامل

Pairwise‎ ‎non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups

Let $G$ be a finite group‎. ‎A subset $X$ of $G$ is a set of pairwise non-commuting elements‎ ‎if any two distinct elements of $X$ do not commute‎. ‎In this paper‎ ‎we determine the maximum size of these subsets in any finite‎ ‎non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup‎.

متن کامل

Inertia elements versus Frobenius elements

Theorem (Generalized Dirichlet Density). Let f : Y → X be a generically finite and Galois morphism of integral separated schemes of finite type over Z. Let K and L denote the function fields of X, respectively Y , and let G := Gal(L|K) be the group of (rational) automorphisms of Y over X. Then the following hold: 1) There exists an open sub-scheme U ⊂ X such that f is étale above U , and if V =...

متن کامل

Derangements and p-elements in permutation groups

2. (Jordan) A transitive permutation group of degree n > 1 contains a derangement. In fact (Cameron and Cohen) the proportion of derangements in a transitive group G is at least 1/n. Equality holds if and only if G is sharply 2transitive, and hence is the affine group {x 7→ ax + b : a, b ∈ F, a 6= 0} over a nearfield F. The finite nearfields were determined by Zassenhaus. They all have prime po...

متن کامل

FINDING CENTRAL DECOMPOSITIONS OF p-GROUPS

Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of finite ∗-rings and also the Las Vegas C-MeatAxe. When p is small, the probabilistic methods can be replaced by deterministic polynomial-time algorithms. The me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1994

ISSN: 0021-8693

DOI: 10.1006/jabr.1994.1067